Almost correct bracket sequence - HackerEarth Solution


Dynamic Programming

Python Code:

t = int(input())

for i in range(t):
    x = list(map(int, input().split()))
    y = []
    if x[1]>2:
        print("Impossible")
    else:
        if x[0]==1 and x[1]==1:
            print("(")
        elif x[0]==1 and x[1]==2:
            print(")")
        else:

            for j in range(x[0]):
                if j%2==0:
                    print("(", end = '')
                else:
                    print(")", end = '')
    print()


Comments

Submit
0 Comments
More Questions

152C - Pocket Book
1681D - Required Length
1725D - Deducing Sortability
1501A - Alexey and Train
721B - Passwords
1263D - Secret Passwords
1371B - Magical Calendar
1726E - Almost Perfect
1360C - Similar Pairs
900A - Find Extra One
1093D - Beautiful Graph
748A - Santa Claus and a Place in a Class
1511B - GCD Length
676B - Pyramid of Glasses
597A - Divisibility
1632A - ABC
1619D - New Year's Problem
242B - Big Segment
938A - Word Correction
159C - String Manipulation 10
258A - Little Elephant and Bits
1536C - Diluc and Kaeya
1428C - ABBB
1557A - Ezzat and Two Subsequences
255A - Greg's Workout
1059A - Cashier
1389C - Good String
1561A - Simply Strange Sort
1337B - Kana and Dragon Quest game
137C - History